Implementing Lindahl allocations by a withholding mechanism
نویسندگان
چکیده
منابع مشابه
Double implementation of Lindahl allocations by a pure mechanism
This paper considers the issue of designing mechanisms whose Nash allocations and strong Nash allocations coincide with Lindahl allocations for public goods economies when coalition patterns, preferences, and endowments are unknown to the designer. It will be noted that the mechanism presented here is feasible and continuous, and the implementation result is obtained without de®ning an arti®cia...
متن کاملA family of supermodular Nash mechanisms implementing Lindahl allocations
The presence of public goods seriously challenges traditional or “natural” solutions for the allocation of private goods. Important policy questions, of whether we can rely on the market to provide optimal amounts of public goods such as air pollution, and how much we can rely on “natural” processes such as voluntary contribution to solve environmental problems, boil down to fundamental issues ...
متن کاملContinuous and Feasible Implementation of Rational-Expectations Lindahl Allocations
In this paper we consider Bayesian implementation of rational-expectations Lindahl allocations for economic environments with public goods when agents are incompletely informed about environments. We construct a continuous and feasible mechanism whose Bayesian equilibrium allocations coincide with rational-expectations Lindahl allocations. We not only allow the types of individuals to be unknow...
متن کاملA note on the stability of Chen's Lindahl mechanism
There are no general theoretical results on the stability of the Lindahl mechanism introduced by Chen (2002). We show that despite not tting the requirements of the Milgrom and Roberts 1990 stability results for supermodular games, if the Chen mechanism induces a supermodular game, then the best reply map will be a contraction. This gives us a easy to identify su¢ cient condition for dynamic s...
متن کاملAlgorithms for Implementing Fair Wireless Power Allocations
We describe algorithms for fairly allocating power among wireless devices sharing a multiple access channel. This problem can be formulated as one of finding a representation of a point in a contra-polymatroid as a convex combination of a small number of its extreme points. We show that this problem is solvable in polynomial time and then describe a fast algorithms based on the Dantzig-Wolfe de...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Economics
سال: 1993
ISSN: 0304-4068
DOI: 10.1016/0304-4068(93)90046-n